Possible Semantics for a Common Framework of Probabilistic Logics

نویسندگان

  • Rolf Haenni
  • Jan-Willem Romeijn
  • Gregory R. Wheeler
  • Jon Williamson
چکیده

1 Bern University of Applied Sciences, Engineering and Information Technology, 2501 Biel, Switzerland, e-mail: [email protected] 2 University of Groningen, Faculty of Philosophy, 9712 GL Groningen, The Netherlands, e-mail: [email protected] 3 Universidade Nova de Lisboa, Department of Computer Science, 2829-516 Caparica, Portugal, e-mail: [email protected] 4 University of Kent, SECL, Philosophy, Canterbury, CT2 7NF, United Kingdom, e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a General Framework for Maximum Entropy Reasoning

A possible approach to extend classical logics to probabilistic logics is to consider a probability distribution over the classical interpretations that satisfies some constraints and maximizes entropy. Over the past years miscellaneous languages and semantics have been considered often based on similar ideas. In this paper a hierarchy of general probabilistic semantics is developed. It incorpo...

متن کامل

A COMMON FRAMEWORK FOR LATTICE-VALUED, PROBABILISTIC AND APPROACH UNIFORM (CONVERGENCE) SPACES

We develop a general framework for various lattice-valued, probabilistic and approach uniform convergence spaces. To this end, we use the concept of $s$-stratified $LM$-filter, where $L$ and $M$ are suitable frames. A stratified $LMN$-uniform convergence tower is then a family of structures indexed by a quantale $N$. For different choices of $L,M$ and $N$ we obtain the lattice-valued, probabili...

متن کامل

Probabilistic Belief Logics

Modal logics based on Kripke style semantics are the prominent formalism in AI for modeling beliefs Kripke semantics involve a collection of possible worlds and a relation among the worlds called an accessibility relation Dependent on the properties of the accessibility relation di erent modal operators can be captured Belief operators have been modeled by an accessibility relation which produc...

متن کامل

Probabilistic Logics and Probabilistic Networks

While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches to probabilistic logic fit into a simple unifying framework: logically complex evidence can be u...

متن کامل

On Correspondences between Probabilistic First-Order and Description Logics

This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We argue that this is an appropriate way of investigating its properties and developing extensions. We show how the previously made arguments about different types of first-order probabilistic semantics apply to P-SHIQ. This app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008